An Efficient Dynamic Privacy-preserving Secure Knn Classification Using Semi-honest Model
نویسندگان
چکیده
Data mining has large applications in many real world areas. Classification is one of the frequently needed tasks in data mining frameworks. For the existing studies, due to the rise of different privacy problems, various solutions to the theoretical and practical classification issues have been suggested under different security models. In this paper proposed a protected k-NN classifier over Paillier encrypted data in the real world dataset. The proposed protocol saves the privacy of user’s input query, confidentiality of data and also hides the data access patterns. Our first work is secure k-NN classifier is to develop on the encrypted data using Paillier scheme under the privacy preserving semihonest protocol model. Also, we empirically estimate the efficiency of our proposed protocol by a real-world dataset under various parameter settings.
منابع مشابه
Privacy-Preserving Data Mining in Malicious Model
Most of the previous cryptographic work in privacy-preserving data mining suggest solutions in the semi-honest model. Semi-honest model assumes that participating parties follows the prescribed protocol but try to infer private information using the messages they receive during the protocol. Although semi-honest model is realistic in many settings, there are cases where it may be better to use ...
متن کاملPrivacy-preserving data mining in the malicious model
Most of the cryptographic work in privacy-preserving distributed data mining deals with semi-honest adversaries, which are assumed to follow the prescribed protocol but try to infer private information using the messages they receive during the protocol. Although the semi-honest model is reasonable in some cases, it is unrealistic to assume that adversaries will always follow the protocols exac...
متن کاملPrivacy-Preserving Graph Algorithms in the Semi-honest Model
We consider scenarios in which two parties, each in possession of a graph, wish to compute some algorithm on their joint graph in a privacy-preserving manner, that is, without leaking any information about their inputs except that revealed by the algorithm’s output. Working in the standard secure multi-party computation paradigm, we present new algorithms for privacy-preserving computation of A...
متن کاملPrivacy-Preserving Data Mining in Presence of Covert Adversaries
Disclosure of the original data sets is not acceptable due to privacy concerns in many distributed data mining settings. To address such concerns, privacy-preserving data mining has been an active research area in recent years. All the recent works on privacy-preserving data mining have considered either semi-honest or malicious adversarial models, whereby an adversary is assumed to follow or a...
متن کاملAn Efficient and Secure Protocol for Privacy Preserving Set Intersection
When datasets are distributed on different sources, finding out their intersection while preserving the privacy of the datasets is a widely required task. In this paper, we address the Privacy Preserving Set Intersection (PPSI) problem, in which each party learns no elements other than the intersection of the N private datasets. We propose an efficient protocol based on a threshold cryptosystem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016